<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>5</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Vakali, Athena</style></author><author><style face="normal" font="default" size="100%">Kitmeridis, Nikolaos</style></author><author><style face="normal" font="default" size="100%">Panourgia, Maria</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Angelov, Plamen</style></author><author><style face="normal" font="default" size="100%">Manolopoulos, Yannis</style></author><author><style face="normal" font="default" size="100%">Iliadis, Lazaros</style></author><author><style face="normal" font="default" size="100%">Roy, Asim</style></author><author><style face="normal" font="default" size="100%">Vellasco, Marley</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">A Distributed Framework for Early Trending Topics Detection on Big Social Networks Data Threads</style></title><secondary-title><style face="normal" font="default" size="100%">Advances in Big Data: Proceedings of the 2nd INNS Conference on Big Data, October 23-25, 2016, Thessaloniki, Greece</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2016</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://dx.doi.org/10.1007/978-3-319-47898-2_20</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">Springer International Publishing</style></publisher><pub-location><style face="normal" font="default" size="100%">Cham</style></pub-location><pages><style face="normal" font="default" size="100%">186–194</style></pages><isbn><style face="normal" font="default" size="100%">978-3-319-47898-2</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;Social networks have become big data production engines and their analytics can reveal insightful trending topics, such that hidden knowledge can be utilized in various applications and settings. This paper addresses the problem of popular topics’ and trends’ early prediction out of social networks data streams which demand distributed software architectures. Under an online time series classification model, which is implemented in a flexible and adaptive distributed framework, trending topics are detected. Emphasis is placed on the early detection process and on the performance of the proposed framework. The implemented framework builds on the lambda architecture design and the experimentation carried out highlights the usefulness of the proposed approach in early trends detection with high rates in performance and with a validation aligned with a popular microblogging service.&lt;/p&gt;
</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>10</ref-type><contributors><secondary-authors><author><style face="normal" font="default" size="100%">Benatallah, Boualem</style></author><author><style face="normal" font="default" size="100%">Bestavros, Azer</style></author><author><style face="normal" font="default" size="100%">Manolopoulos, Yannis</style></author><author><style face="normal" font="default" size="100%">Athena Vakali</style></author><author><style face="normal" font="default" size="100%">Zhang, Yanchun</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Web Information Systems Engineering - WISE 2014 - 15th International Conference, Thessaloniki, Greece, October 12-14, 2014, Proceedings, Part I</style></title><secondary-title><style face="normal" font="default" size="100%">WISE (1)</style></secondary-title><tertiary-title><style face="normal" font="default" size="100%">Lecture Notes in Computer Science</style></tertiary-title></titles><dates><year><style  face="normal" font="default" size="100%">2014</style></year></dates><publisher><style face="normal" font="default" size="100%">Springer</style></publisher><volume><style face="normal" font="default" size="100%">8786</style></volume><isbn><style face="normal" font="default" size="100%">978-3-319-11748-5</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>10</ref-type><contributors><secondary-authors><author><style face="normal" font="default" size="100%">Benatallah, Boualem</style></author><author><style face="normal" font="default" size="100%">Bestavros, Azer</style></author><author><style face="normal" font="default" size="100%">Manolopoulos, Yannis</style></author><author><style face="normal" font="default" size="100%">Athena Vakali</style></author><author><style face="normal" font="default" size="100%">Zhang, Yanchun</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Web Information Systems Engineering - WISE 2014 - 15th International Conference, Thessaloniki, Greece, October 12-14, 2014, Proceedings, Part II</style></title><secondary-title><style face="normal" font="default" size="100%">WISE (2)</style></secondary-title><tertiary-title><style face="normal" font="default" size="100%">Lecture Notes in Computer Science</style></tertiary-title></titles><dates><year><style  face="normal" font="default" size="100%">2014</style></year></dates><publisher><style face="normal" font="default" size="100%">Springer</style></publisher><volume><style face="normal" font="default" size="100%">8787</style></volume><isbn><style face="normal" font="default" size="100%">978-3-319-11745-4</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Maria Giatsoglou</style></author><author><style face="normal" font="default" size="100%">Despoina Chatzakou</style></author><author><style face="normal" font="default" size="100%">Athena Vakali</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Lin, Xuemin</style></author><author><style face="normal" font="default" size="100%">Manolopoulos, Yannis</style></author><author><style face="normal" font="default" size="100%">Srivastava, Divesh</style></author><author><style face="normal" font="default" size="100%">Huang, Guangyan</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Community Detection in Social Media by Leveraging Interactions and Intensities</style></title><secondary-title><style face="normal" font="default" size="100%">WISE (2)</style></secondary-title><tertiary-title><style face="normal" font="default" size="100%">Lecture Notes in Computer Science</style></tertiary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">community detection</style></keyword><keyword><style  face="normal" font="default" size="100%">user weighted interaction networks</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2013</style></year></dates><publisher><style face="normal" font="default" size="100%">Springer</style></publisher><volume><style face="normal" font="default" size="100%">8181</style></volume><pages><style face="normal" font="default" size="100%">57-72</style></pages><isbn><style face="normal" font="default" size="100%">978-3-642-41153-3</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Stamos, Konstantinos</style></author><author><style face="normal" font="default" size="100%">Pallis, George</style></author><author><style face="normal" font="default" size="100%">Athena Vakali</style></author><author><style face="normal" font="default" size="100%">Katsaros, Dimitrios</style></author><author><style face="normal" font="default" size="100%">Sidiropoulos, Antonis</style></author><author><style face="normal" font="default" size="100%">Manolopoulos, Yannis</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">CDNsim: A simulation tool for content distribution networks</style></title><secondary-title><style face="normal" font="default" size="100%">ACM Trans. Model. Comput. Simul.</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">caching</style></keyword><keyword><style  face="normal" font="default" size="100%">Content Distribution Network</style></keyword><keyword><style  face="normal" font="default" size="100%">services</style></keyword><keyword><style  face="normal" font="default" size="100%">trace-driven simulation</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2010</style></year></dates><number><style face="normal" font="default" size="100%">2</style></number><volume><style face="normal" font="default" size="100%">20</style></volume><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;Content Distribution Networks (CDNs) have gained considerable attention in the past few years.As such, there is need for developing frameworks for carrying out CDN simulations. In this paper,we present a modeling and simulation framework for CDNs, called CDNsim. CDNsim hasbeen designated to provide a realistic simulation for CDNs, simulating the surrogate servers, theTCP/IP protocol and the main CDN functions. The main advantages of this tool are its high performance,its extensibility and its user interface which is used to configure its parameters. CDNsimprovides an automated environment for conducting experiments and extracting client, server andnetwork statistics. The purpose of CDNsim is to be used as a testbed for CDN evaluation andexperimentation. This is quite useful both for the research community (to experiment with newCDN data management techniques) and for CDN developers (to evaluate profits on prior certainCDN installations).&lt;/p&gt;
</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Katsaros, Dimitrios</style></author><author><style face="normal" font="default" size="100%">Pallis, George</style></author><author><style face="normal" font="default" size="100%">Stamos, Konstantinos</style></author><author><style face="normal" font="default" size="100%">Athena Vakali</style></author><author><style face="normal" font="default" size="100%">Sidiropoulos, Antonis</style></author><author><style face="normal" font="default" size="100%">Manolopoulos, Yannis</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">CDNs Content Outsourcing via Generalized Communities</style></title><secondary-title><style face="normal" font="default" size="100%">IEEE Trans. Knowl. Data Eng.</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">caching</style></keyword><keyword><style  face="normal" font="default" size="100%">content distribution networks</style></keyword><keyword><style  face="normal" font="default" size="100%">replication</style></keyword><keyword><style  face="normal" font="default" size="100%">social network analysis</style></keyword><keyword><style  face="normal" font="default" size="100%">web communities</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2009</style></year></dates><number><style face="normal" font="default" size="100%">1</style></number><volume><style face="normal" font="default" size="100%">21</style></volume><pages><style face="normal" font="default" size="100%">137-151</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;Content distribution networks (CDNs) balance costs and quality in services related to content delivery. Devising an efficientcontent outsourcing policy is crucial since, based on such policies, CDN providers can provide client-tailored content, improveperformance, and result in significant economical gains. Earlier content outsourcing approaches may often prove ineffective since theydrive prefetching decisions by assuming knowledge of content popularity statistics, which are not always available and are extremelyvolatile. This work addresses this issue, by proposing a novel self-adaptive technique under a CDN framework on which outsourcedcontent is identified with no a priori knowledge of (earlier) request statistics. This is employed by using a structure-based approachidentifying coherent clusters of â€ścorrelatedâ€ť Web server content objects, the so-called Web page communities. These communities arethe core outsourcing unit, and in this paper, a detailed simulation experimentation has shown that the proposed technique is robust andeffective in reducing user-perceived latency as compared with competing approaches, i.e., two communities-based approaches, Webcaching, and non-CDN.&lt;/p&gt;
</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Sidiropoulos, Antonis</style></author><author><style face="normal" font="default" size="100%">Pallis, George</style></author><author><style face="normal" font="default" size="100%">Katsaros, Dimitrios</style></author><author><style face="normal" font="default" size="100%">Stamos, Konstantinos</style></author><author><style face="normal" font="default" size="100%">Athena Vakali</style></author><author><style face="normal" font="default" size="100%">Manolopoulos, Yannis</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Prefetching in Content Distribution Networks via Web Communities Identification and Outsourcing</style></title><secondary-title><style face="normal" font="default" size="100%">World Wide Web</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2008</style></year></dates><number><style face="normal" font="default" size="100%">1</style></number><volume><style face="normal" font="default" size="100%">11</style></volume><pages><style face="normal" font="default" size="100%">39-70</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Stamos, Konstantinos</style></author><author><style face="normal" font="default" size="100%">Pallis, George</style></author><author><style face="normal" font="default" size="100%">Athena Vakali</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Manolopoulos, Yannis</style></author><author><style face="normal" font="default" size="100%">Pokorny, Jaroslav</style></author><author><style face="normal" font="default" size="100%">Sellis, Timos K.</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Integrating Caching Techniques on a Content Distribution Network</style></title><secondary-title><style face="normal" font="default" size="100%">ADBIS</style></secondary-title><tertiary-title><style face="normal" font="default" size="100%">Lecture Notes in Computer Science</style></tertiary-title></titles><dates><year><style  face="normal" font="default" size="100%">2006</style></year></dates><publisher><style face="normal" font="default" size="100%">Springer</style></publisher><volume><style face="normal" font="default" size="100%">4152</style></volume><pages><style face="normal" font="default" size="100%">200-215</style></pages><isbn><style face="normal" font="default" size="100%">3-540-37899-5</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;Web caching and replication tune capacity with performance and theyhave become essential components of the Web. In practice, caching and replicationtechniques have been applied in proxy servers and Content DistributionNetworks (CDNs) respectively. In this paper, we investigate the benefits of integratingcaching policies on a CDNâ€™ s infrastructure. Using a simulation testbed,our results indicate that there is much room for performance improvement interms of perceived latency, hit ratio and byte hit ratio. Moreover, we show thatthe combination of caching with replication fortifies CDNs against flash crowdevents.&lt;/p&gt;
</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Pallis, George</style></author><author><style face="normal" font="default" size="100%">Stamos, Konstantinos</style></author><author><style face="normal" font="default" size="100%">Athena Vakali</style></author><author><style face="normal" font="default" size="100%">Katsaros, Dimitrios</style></author><author><style face="normal" font="default" size="100%">Sidiropoulos, Antonis</style></author><author><style face="normal" font="default" size="100%">Manolopoulos, Yannis</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Barga, Roger S.</style></author><author><style face="normal" font="default" size="100%">Zhou, Xiaofang</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Replication Based on Objects Load under a Content Distribution Network</style></title><secondary-title><style face="normal" font="default" size="100%">ICDE Workshops</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2006</style></year></dates><publisher><style face="normal" font="default" size="100%">IEEE Computer Society</style></publisher><pages><style face="normal" font="default" size="100%">53</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Pallis, George</style></author><author><style face="normal" font="default" size="100%">Athena Vakali</style></author><author><style face="normal" font="default" size="100%">Stamos, Konstantinos</style></author><author><style face="normal" font="default" size="100%">Sidiropoulos, Antonis</style></author><author><style face="normal" font="default" size="100%">Katsaros, Dimitrios</style></author><author><style face="normal" font="default" size="100%">Manolopoulos, Yannis</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A Latency-Based Object Placement Approach in Content Distribution Networks</style></title><secondary-title><style face="normal" font="default" size="100%">LA-WEB</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2005</style></year></dates><publisher><style face="normal" font="default" size="100%">IEEE Computer Society</style></publisher><pages><style face="normal" font="default" size="100%">140-147</style></pages><isbn><style face="normal" font="default" size="100%">0-7695-2471-0</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Athena Vakali</style></author><author><style face="normal" font="default" size="100%">Manolopoulos, Yannis</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Data placement schemes in replicated mirrored disk systems</style></title><secondary-title><style face="normal" font="default" size="100%">Journal of Systems and Software</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2000</style></year></dates><number><style face="normal" font="default" size="100%">2</style></number><volume><style face="normal" font="default" size="100%">55</style></volume><pages><style face="normal" font="default" size="100%">115-128</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Athena Vakali</style></author><author><style face="normal" font="default" size="100%">Manolopoulos, Yannis</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Litwin, Witold</style></author><author><style face="normal" font="default" size="100%">Morzy, Tadeusz</style></author><author><style face="normal" font="default" size="100%">Vossen, Gottfried</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Replication in Mirrored Disk Systems</style></title><secondary-title><style face="normal" font="default" size="100%">ADBIS</style></secondary-title><tertiary-title><style face="normal" font="default" size="100%">Lecture Notes in Computer Science</style></tertiary-title></titles><dates><year><style  face="normal" font="default" size="100%">1998</style></year></dates><publisher><style face="normal" font="default" size="100%">Springer</style></publisher><volume><style face="normal" font="default" size="100%">1475</style></volume><pages><style face="normal" font="default" size="100%">224-235</style></pages><isbn><style face="normal" font="default" size="100%">3-540-64924-7</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">In this paper we study data replication in a mirrored disk system.Free disk space is exploited by keeping replicas of specific cylindersat appropriate disk locations. Assuming an organ-pipe arrangement wecalculate the expected seek distance by varying the probability cylinderaccess under different distributions. Also, analytic formulae are derivedfor the expected seek distance under replication and comparison with theconventional (without replication) mirrored disk system is performed.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Athena Vakali</style></author><author><style face="normal" font="default" size="100%">Manolopoulos, Yannis</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">An Exact Analysis on Expected Seeks in Shadowed Disks</style></title><secondary-title><style face="normal" font="default" size="100%">Inf. Process. Lett.</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">1997</style></year></dates><number><style face="normal" font="default" size="100%">6</style></number><volume><style face="normal" font="default" size="100%">61</style></volume><pages><style face="normal" font="default" size="100%">323-329</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Athena Vakali</style></author><author><style face="normal" font="default" size="100%">Manolopoulos, Yannis</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Parallel data paths in two-headed disk systems</style></title><secondary-title><style face="normal" font="default" size="100%">Information &amp; Software Technology</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">1997</style></year></dates><number><style face="normal" font="default" size="100%">2</style></number><volume><style face="normal" font="default" size="100%">39</style></volume><pages><style face="normal" font="default" size="100%">125-135</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Athena Vakali</style></author><author><style face="normal" font="default" size="100%">Manolopoulos, Yannis</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Wagner, Roland</style></author><author><style face="normal" font="default" size="100%">Thoma, Helmut</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">The Impact of Seeking in Partial Match Retrieval</style></title><secondary-title><style face="normal" font="default" size="100%">DEXA Workshop</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">1996</style></year></dates><publisher><style face="normal" font="default" size="100%">IEEE Computer Society</style></publisher><pages><style face="normal" font="default" size="100%">432-437</style></pages><isbn><style face="normal" font="default" size="100%">0-8186-7662-0</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;In the pastthe issue of partial match query satisfaction has been investigated inorder to establish allocation schemes minimizing the number of accessed disk pages. Inthe present workwe extend the problem by studying the impact of the seeking duringpartial match query satisfaction. The physical location of resulting pages is the newaspect studied here by considering the number and the sparseness of cylinders holding theresulting pages . Lower and upper seek time boundsas well as the average behavior ofthe seek time are calculated by assuming some real figures of specific modern disk systemdevices  The main conclusion is that the seek time is a fact or affecting the partial matchquery response time and needs to be included in the overall performance measuring.&lt;/p&gt;
</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Manolopoulos, Yannis</style></author><author><style face="normal" font="default" size="100%">Athena Vakali</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Revell, Norman</style></author><author><style face="normal" font="default" size="100%">Tjoa, A Min</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Partial Match Retrieval in Two-Headed Disk Systems</style></title><secondary-title><style face="normal" font="default" size="100%">DEXA</style></secondary-title><tertiary-title><style face="normal" font="default" size="100%">Lecture Notes in Computer Science</style></tertiary-title></titles><dates><year><style  face="normal" font="default" size="100%">1995</style></year></dates><publisher><style face="normal" font="default" size="100%">Springer</style></publisher><volume><style face="normal" font="default" size="100%">978</style></volume><pages><style face="normal" font="default" size="100%">594-603</style></pages><isbn><style face="normal" font="default" size="100%">3-540-60303-4</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Manolopoulos, Yannis</style></author><author><style face="normal" font="default" size="100%">Athena Vakali</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Seek Distances in Disks with Two Independent Heads Per Surface</style></title><secondary-title><style face="normal" font="default" size="100%">Inf. Process. Lett.</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">1991</style></year></dates><number><style face="normal" font="default" size="100%">1</style></number><volume><style face="normal" font="default" size="100%">37</style></volume><pages><style face="normal" font="default" size="100%">37-42</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record></records></xml>